Steiner tree problem

Results: 87



#Item
31The Steiner Tree Problem In this problem we are given as input an undirected connected graph with non-negative weights, and a subset R of vertices (R stands for Required ). The output is a (Steiner) tree that contains a

The Steiner Tree Problem In this problem we are given as input an undirected connected graph with non-negative weights, and a subset R of vertices (R stands for Required ). The output is a (Steiner) tree that contains a

Add to Reading List

Source URL: www.eng.tau.ac.il

Language: English
    32Lower Bounds For Kinetic Planar Subdivisions Pankaj K. Agarwaly Julien Baschz Mark de Bergx John Hershbergerk

    Lower Bounds For Kinetic Planar Subdivisions Pankaj K. Agarwaly Julien Baschz Mark de Bergx John Hershbergerk

    Add to Reading List

    Source URL: www.cs.duke.edu

    Language: English - Date: 2011-12-02 14:30:54
    33Geometry of the Space of Phylogenetic Trees Louis J. Billera Department of Mathematics, Malott Hall, Cornell University, Ithaca, NYE-mail: and

    Geometry of the Space of Phylogenetic Trees Louis J. Billera Department of Mathematics, Malott Hall, Cornell University, Ithaca, NYE-mail: and

    Add to Reading List

    Source URL: statweb.stanford.edu

    Language: English - Date: 2001-05-02 19:20:29
    34Kannan and Wheeler Algorithms for Molecular Biology 2012, 7:9 http://www.almob.org/contentRESEARCH Open Access

    Kannan and Wheeler Algorithms for Molecular Biology 2012, 7:9 http://www.almob.org/contentRESEARCH Open Access

    Add to Reading List

    Source URL: www.almob.org

    Language: English
    35Geometric Theory Predicts Bifurcations in Minimal Wiring Cost Trees in Biology Are Flat Yihwa Kim1., Robert Sinclair2., Nol Chindapol3, Jaap A. Kaandorp3, Erik De Schutter1* 1 Computational Neuroscience Unit, Okinawa Ins

    Geometric Theory Predicts Bifurcations in Minimal Wiring Cost Trees in Biology Are Flat Yihwa Kim1., Robert Sinclair2., Nol Chindapol3, Jaap A. Kaandorp3, Erik De Schutter1* 1 Computational Neuroscience Unit, Okinawa Ins

    Add to Reading List

    Source URL: www.tnb.ua.ac.be

    Language: English - Date: 2014-02-10 10:38:37
    36CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Approximating the Geometric Minimum-Diameter Spanning Tree Michael J. Spriggs∗ J. Mark Keil†

    CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Approximating the Geometric Minimum-Diameter Spanning Tree Michael J. Spriggs∗ J. Mark Keil†

    Add to Reading List

    Source URL: www.cccg.ca

    Language: English - Date: 2004-01-08 18:44:30
    37CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximate Shortest Descent Path on a Terrain Sasanka Roy∗ , Sachin Lodha∗, Sandip Das† and Anil Maheshwari‡ Abstract

    CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximate Shortest Descent Path on a Terrain Sasanka Roy∗ , Sachin Lodha∗, Sandip Das† and Anil Maheshwari‡ Abstract

    Add to Reading List

    Source URL: cccg.ca

    Language: English - Date: 2008-10-28 21:24:07
    38CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

    CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

    Add to Reading List

    Source URL: cccg.ca

    Language: English - Date: 2008-10-28 21:29:08
    39CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

    CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

    Add to Reading List

    Source URL: cccg.ca

    Language: English - Date: 2008-10-28 21:29:26
    40CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on

    CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Open Problems from CCCG 2007 Erik D. Demaine∗ The following is a list of the problems presented on

    Add to Reading List

    Source URL: cccg.ca

    Language: English - Date: 2008-10-29 00:00:35